Performance analysis of Fridrich-Goljan self-embedding authentication method
نویسندگان
چکیده
This paper analyzes the performance of the image authentication method based on robust hashing proposed by J. Fridrich and M. Goljan. In this method both the embedder and the detector generate the watermark from a perceptual digest of the image. Therefore, an accurate performance analysis requires assessing the relation between noise and hash bit errors. Our approach first derives the probability of hash bit error due to watermark embedding and/or the attack, and then uses such probability to derive the probabilities of false positive and false negative. Index Terms Content-based authentication, robust hash, performance analysis.
منابع مشابه
Images with Self-Correcting Capabilities
In this paper, we introduce two techniques for selfembedding an image in itself as a means for protecting the image content. After self-embedding, it is possible to recover portions of the image that have been cropped out, replaced, damaged, or otherwise tampered without accessing the original image. The first method is based on transforming small 8×8 blocks using a DCT, quantizing the coeffici...
متن کاملLossless data embedding with file size preservation
In lossless watermarking, it is possible to completely remove the embedding distortion from the watermarked image and recover an exact copy of the original unwatermarked image. Lossless watermarks found applications in fragile authentication, integrity protection, and metadata embedding. It is especially important for medical and military images. Frequently, lossless embedding disproportionably...
متن کاملHandling uneven embedding capacity in binary images: a revisit
Hiding data in binary images can facilitate the authentication and annotation of important document images in digital domain. A representative approach is to first identify pixels whose binary color can be flipped without introducing noticeable artifacts, and then embed one bit in each non-overlapping block by adjusting the flippable pixel values to obtain the desired block parity. The distribu...
متن کاملEfficient Wet Paper Codes
Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipient. In this paper, we describe new approaches to wet paper codes that enjoy low computational complexity and improved embedding efficiency (number of message bits per embedding change). Some applications of wet paper codes to st...
متن کاملLossless Data Embedding - New Paradigm in Digital Watermarking
One common drawback of virtually all current data embedding methods is the fact that the original image is inevitably distorted due to data embedding itself. This distortion typically cannot be removed completely due to quantization, bit-replacement, or truncation at the grayscales 0 and 255. Although the distortion is often quite small and perceptual models are used to minimize its visibility,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Forensics and Security
دوره 4 شماره
صفحات -
تاریخ انتشار 2009